Hall sets, Lazard sets and comma-free codes
نویسندگان
چکیده
منابع مشابه
COMPLETING COMMA-FREE CODES by
We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.
متن کاملVarieties of comma-free codes
New varieties of comma-free codes CFC of length 3 on the 4-letter alphabet are defined and analysed: self-complementary comma-free codes (CCFC), C3 comma-free codes (C3CFC), C3 self-complementary comma-free codes (C3CCFC), selfcomplementary maximal comma-free codes (CMCFC), C3 maximal comma-free codes (C3MCFC) and C3 self-complementary maximal comma-free codes (C3CMCFC). New properties with wor...
متن کاملRestrictions and Generalizations on Comma-Free Codes
A significant sector of coding theory is that of comma-free coding; that is, codes which can be received without the need of a letter used for word separation. The major difficulty is in finding bounds on the maximum number of comma-free words which can inhabit a dictionary. We introduce a new class called a self-reflective comma-free dictionary and prove a series of bounds on the size of such ...
متن کاملLDPC Codes from Triangle-Free Line Sets
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles and necessarily has girth at least 8. One can then use the associated incidence matrices to form binary linear codes which can be considered as LDPC codes. The relatively high girth allows for efficient implementation o...
متن کاملBinary templates for comma-free DNA codes
Arita and Kobayashi proposed a method for constructing comma-free DNA codes using binary templates, and showed that the separation d of any such binary template of length n satisfies d n/2. Kobayashi, Kondo andArita later produced an infinite family of binary templates with d 11n/30. Here we demonstrate the existence of an infinite family of binary templates with d >n/2 − (18n loge n) 1/2. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.08.034